class Solution:
def customSortString(self, S: str, T: str) -> str:
a = ""
l = list(T)
for i in range(len(S)):
for j in range(len(l)):
if S[i] == l[j]:
a = a + T[j]
l[j] = ""
l = "".join(l)
return a+l
1733A - Consecutive Sum | 1733B - Rule of League |
1733C - Parity Shuffle Sorting | 1264A - Beautiful Regional Contest |
1695A - Subrectangle Guess | 467B - Fedor and New Game |
252C - Points on Line | 735C - Tennis Championship |
992A - Nastya and an Array | 554A - Kyoya and Photobooks |
79B - Colorful Field | 265B - Roadside Trees (Simplified Edition) |
1362C - Johnny and Another Rating Drop | 1214C - Bad Sequence |
1091B - New Year and the Treasure Geolocation | 244A - Dividing Orange |
1061C - Multiplicity | 1312A - Two Regular Polygons |
801A - Vicious Keyboard | 510B - Fox And Two Dots |
616D - Longest k-Good Segment | 1604A - Era |
555B - Case of Fugitive | 551A - GukiZ and Contest |
1399F - Yet Another Segments Subset | 1371C - A Cookie for You |
430B - Balls Game | 1263A - Sweet Problem |
1332B - Composite Coloring | 254A - Cards with Numbers |